A uniqueness theorem for Haar measure

Markov-Kakutani Theorem and Haar Measure

A Uniqueness Theorem for Clustering

Despite the widespread use of Clustering, there is distressingly little general theory of clustering available. Questions like “What distinguishes a clustering of data from other data partitioning?”, “Are there any principles governing all clustering paradigms?”, “How should a user choose an appropriate clustering algorithm for a particular task?”, etc. are almost completely unanswered by the e...

A SHORT PROOF FOR THE EXISTENCE OF HAAR MEASURE ON COMMUTATIVE HYPERGROUPS

In this short note, we have given a short proof for the existence of the Haar measure on commutative locally compact hypergroups based on functional analysis methods by using Markov-Kakutani fixed point theorem.

The uniqueness theorem for inverse nodal problems with a chemical potential

In this paper, an inverse nodal problem for a second-order differential equation having a chemical potential on a finite interval is investigated. First, we estimate the nodal points and nodal lengths of differential operator. Then, we show that the potential can be uniquely determined by a dense set of nodes of the eigenfunctions.

The Haar Measure

In this section, we give a brief review of the measure theory which will be used in later sections. We use [R, Chapters 1 and 2] as our main resource. A σ-algebra on a set X is a collectionM of subsets of X such that ∅ ∈M, if S ∈M, then X \ S ∈ M, and if a countable collection S1, S2, . . . ∈ M, then ∪i=1Si ∈ M. That is, M is closed under complements and countable unions, and contains the empty...